Correction to: Fast Parallel Bellman-Ford-Moore Algorithm Implementation for Small Graphs
نویسندگان
چکیده
In an older version of this paper, the presentation Sergey Komech’s affiliation was misleading. This has been corrected.
منابع مشابه
On the optimality of Bellman-Ford-Moore shortest path algorithm
We prove a general lower bound on the size of switching-and-rectifier networks over any semiring of zero characteristic, including the (min,+) semiring. Using it, we show that the classical dynamic programming algorithm of Bellman, Ford and Moore for the shortest s-t path problem is optimal, if only Min and Sum operations are allowed.
متن کاملThe Bellman-ford Algorithm and “distributed Bellman-ford”
In the spring of 2003, I began to wonder about the history of the Bellman-Ford algorithm [CLRS01] for finding shortest paths in a graph. In particular, I was interested in understanding when Bellman’s name and Ford’s name became jointly associated with the algorithm. To research these questions, I made trips to the BBN Technologies and MIT libraries, did Web searches, and sent emails to univers...
متن کاملHybrid Bellman-Ford-Dijkstra algorithm
Consider the single-source cheapest paths problem in a digraph with negative edge costs allowed. A hybrid of Bellman-Ford and Dijkstra algorithms is suggested, improving the running time bound upon Bellman-Ford for graphs with a sparse distribution of negative cost edges. The algorithm iterates Dijkstra several times without reinitializing values d(v) at vertices. At most k+2 executions of Dijk...
متن کاملShortest Paths and Negative Cycle Detection in Graphs with Negative Weights — I: The Bellman-Ford-Moore Algorithm Revisited
Since the mid 1950’s when Bellman, Ford, and Moore developped their shortest path algorithm various attempts were made to beat the O(n ·m) barrier without success. For the special case of integer weights Goldberg’s algorithm gave a theoretical improvement, but the algorithm isn’t competative in praxis. This technical report is part one of a summary of existing n-pass algorithms and some new var...
متن کاملRandomized Speedup of the Bellman-Ford Algorithm
We describe a variant of the Bellman–Ford algorithm for single-source shortest paths in graphs with negative edges but no negative cycles that randomly permutes the vertices and uses this randomized order to process the vertices within each pass of the algorithm. The modification reduces the worst-case expected number of relaxation steps of the algorithm, compared to the previously-best variant...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2023
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-22941-1_51